Pii: S0166-5316(99)00056-5

نویسندگان

  • H. Hermanns
  • V. Mertsiotakis
  • M. Siegle
چکیده

Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations. ©2000 Published by Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositional performance modelling with the TIPPtool

Stochastic Process Algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art-techniques, and wrapped in a user-friendly gra...

متن کامل

Distributions of the Interdeparture Times in FCFS and Nonpreemptive Priority MMAP [2]/G [2]/1 Queues

This paper deals with single server queueing systems with two classes of customers and a correlated arrival process. The focus is on the interdeparture times of each class of customer. A uniform approach is introduced to find the Laplace–Stieltjes transforms of interdeparture times for queueing systems with equal priority and nonpreemptive priority, respectively. Algorithms can be developed for...

متن کامل

On the convergence of the power series algorithm

In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. We show that normalization plays a crucial role and that the convergence can be improved by introducing some minor changes in the algorithm. We illustrate this with several numerical examples.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000